package leetcode.code;

public class Solution1929 {

	public int[] getConcatenation(int[] nums) {
		int len = nums.length;
		int[] ans = new int[2 * len];
		for (int i = 0; i < len; i++) {
			ans[i] = nums[i];
			ans[i + len] = nums[i];
		}
		return ans;
	}

	public static void main(String[] args) {

	}

}
